A doubly cyclic channel assignment problem

A Doubly Cyclic Channel Assignment Problem

A standard model for radio channel assignment involves a set V of sites, the set (0, 1,2,. .} of channels, and a constraint matrix (w(u,v)) specifying minimum channel separations. An assignment f : V + {0,1,2,. . .} is feasible if the distance I.f(u) f(u)1 b w(u, u) for each pair of sites u and u. The aim is to find the least k such that there is a feasible assignment using only the k channels ...

A Theorem about the Channel Assignment Problem

Frequency Insertion Strategy for Channel Assignment Problem

This paper presents a new heuristic method for quickly finding a good feasible solution to the channel assignment problem (CAP). Like many other greedy-type heuristics for CAP, the proposed method also assigns a frequency to a call, one at a time. Hence, the method requires computational time that increases only linear to the number of calls. However, what distinguishes the method from others i...

Fixed Channel Assignment and Neural Network Algorithm for Channel Assignment Problem in Cellular Radio Networks

The channel-assignment problem is important in mobile telephone communication. Since the usable range of the frequency spectrum is limited, the optimal channel-assignment problem has become increasingly important. The goal of this problem is to find a channel assignment to requested calls with the minimum number of channels subject to interference constraints between channels. This algorithm co...

A fast constructive algorithm for fixed channel assignment problem

With limited frequency spectrum and an increasing demand for mobile communication services, the problem of channel assignment becomes increasingly important. It has been shown that this problem is equivalent to the graph-coloring problem, which is an NP-hard problem [l]. In this work, a fast constructive algorithm is introduced to solve the problem. The objective of the algorithni is to obtain ...